Kernels in edge-colored digraphs
نویسندگان
چکیده
منابع مشابه
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
Let G be an eulerian digraph with a fixed edge coloring (not necessarily a proper edge coloring). A compatible circuit of G is an eulerian circuit such that every two consecutive edges in the circuit have different colors. We characterize the existence of compatible circuits for directed graphs avoiding certain vertices of outdegree three. Our result is analogous to a result of Kotzig for compa...
متن کاملKernels and some operations in edge-coloured digraphs
Let D be an edge-coloured digraph, V (D) will denote the set of vertices of D; a set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the following two conditions: For every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; for every vertex x ∈ V (D) − N there is a vertex y ∈ N such that there is an xy -monochromatic direct...
متن کاملČerný conjecture for edge-colored digraphs with few junctions
In this paper we consider the Cerny conjecture in terminology of colored digraphs corresponding to finite automata. We define a class of colored digraphs having a relatively small number of junctions between paths determined by different colors, and prove that digraphs in this class satisfy the Cerny conjecture. We argue that this yields not only a new class of automata for which the Cerny conj...
متن کاملMonochromatic paths on edge colored digraphs and state splittings
We look at the behavior under state splitting of distinct kinds of properties regarding monochromatic paths on edge colored digraphs. These are absorbance and independence as well as the existence of kernels, semikernels, quasikernels and Grundy functions, all of them defined in terms of monochromatic paths.
متن کاملkernels in circulant digraphs
a kernel $j$ of a digraph $d$ is an independent set of vertices of $d$ such that for every vertex $w,in,v(d),setminus,j$ there exists an arc from $w$ to a vertex in $j.$in this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. this characterization is a partial solution to the following problem: characterize circulant digraphs which hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00162-3